The Phase Problem: A Problem in Constrained Global Optimization
نویسنده
چکیده
It is now almost 200 years since Gauss, a teenager at the time, formulated his famous principle of least-squares and used it to determine, for the first time, the orbit of one of the asteroids, a problem which had defeated astronomers for years. When applied to the crystallographic phase problem, least-squares leads directly to the formulation of the minimal principle, which effectively replaces the phase problem by one of constrained global minimization. Shake-and-Bake, the computer software package which implements this formulation of the phase problem, provides a completely automatic solution of this problem. Shake-and-Bake requires that diffraction intensities to a resolution of 1.2Å, at least, be available. Structures having as many as 600 independent nonhydrogen atoms have been routinely solved in this way; the ultimate potential of the method is still not known. When single-wavelength anomalous scattering (SAS) diffraction data are available, the phase problem may again be formulated as a problem in global optimization. Although the objective function has a myriad of local maxima, its global maxima, never more than two, are readily accessible and easily identified by virtue of their isolation. The ability to determine the global maxima of the objective function represents the latest and most successful attempt to go directly from the known probabilistic estimates of the three-phase structure invariants to the values of the individual phases. The relationship between the maxima of the objective function and the solutions of the newly formulated system of SAS tangent equations plays a key role in this development,
منابع مشابه
A semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملOn the hybrid conjugate gradient method for solving fuzzy optimization problem
In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملParticle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems
The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998